Rainbow Hamilton cycles and lopsidependency
نویسندگان
چکیده
منابع مشابه
Rainbow Hamilton cycles and lopsidependency
The Lovász Local Lemma is a powerful probabilistic tool used to prove the existence of combinatorial structures which avoid a set of constraints. A standard way to apply the local lemma is to prove that the set of constraints satsify a lopsidependency condition and obtain a lopsidependency graph. For instance, Erdős and Spencer used this framework to posit the existence of Latin transversals in...
متن کاملOn Rainbow Hamilton Cycles in Random Hypergraphs
Let H (k) n,p,κ denote a randomly colored random hypergraph, constructed on the vertex set [n] by taking each k-tuple independently with probability p, and then independently coloring it with a random color from the set [κ]. Let H be a k-uniform hypergraph of order n. An `-Hamilton cycle is a spanning subhypergraph C of H with n/(k−`) edges and such that for some cyclic ordering of the vertices...
متن کاملRainbow Hamilton Cycles in Uniform Hypergraphs
Let K (k) n be the complete k-uniform hypergraph, k ≥ 3, and let ` be an integer such that 1 ≤ ` ≤ k − 1 and k − ` divides n. An `-overlapping Hamilton cycle in K (k) n is a spanning subhypergraph C of K (k) n with n/(k− `) edges and such that for some cyclic ordering of the vertices each edge of C consists of k consecutive vertices and every pair of adjacent edges in C intersects in precisely ...
متن کاملRainbow hamilton cycles in random graphs
One of the most famous results in the theory of random graphs establishes that the threshold for Hamiltonicity in the Erdős-Rényi random graph Gn,p is around p ∼ logn+log logn n . Much research has been done to extend this to increasingly challenging random structures. In particular, a recent result by Frieze determined the asymptotic threshold for a loose Hamilton cycle in the random 3-uniform...
متن کاملRainbow Hamilton cycles in random regular graphs
A rainbow subgraph of an edge-coloured graph has all edges of distinct colours. A random d-regular graph with d even, and having edges coloured randomly with d/2 of each of n colours, has a rainbow Hamilton cycle with probability tending to 1 as n→∞, for fixed d ≥ 8.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2017
ISSN: 0012-365X
DOI: 10.1016/j.disc.2017.01.026